A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps
نویسندگان
چکیده
منابع مشابه
Vertices of Degree k in Random Maps
This work is devoted to the study of the typical structure of a random map. Maps are planar graphs embedded in the plane. We investigate the degree sequences of random maps from families of a certain type, which, among others, includes fundamental map classes like those of biconnected maps, 3-connected maps, and triangulations. In particular, we develop a general framework that allows us to der...
متن کاملCentral Limit Theorem in Multitype Branching Random Walk
A discrete time multitype (p-type) branching random walk on the real line R is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.
متن کاملA Central Limit Theorem for Random Fields
A central limit theorem is proved for α-mixing random fields. The sets of locations where the random field is observed become more and more dense in an increasing sequence of domains. The central limit theorem concerns these observations. The limit theorem is applied to obtain asymptotic normality of kernel type density estimators. It turns out that in our setting the covariance structure of th...
متن کاملA Central Limit Theorem for Random Walks in Random Labyrinths
Carol Bezuidenhout and Geoffrey Grimmett Abstract. A beam of light shines through the lattice Zd, and is subjected to reflections determined by a random environment of mirrors at the vertices of Zd. The behaviour of the light ray is investigated under the hypothesis that the environment contains a strictly positive density of vertices at which the light behaves in the manner of a random walk. W...
متن کاملCentral Limit Theorem for Random Fields
A new variant of CLT is established for random elds de ned on Rd which are strictly stationary, with nite second moment and weakly dependent (comprising cases of positive or negative association). The summation domains grow in the van Hove sense. Simultaneously the indices of observations form more and more dense grids in these domains. Thus the e ect of combining two scaling procedures is stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9751-x